Infinite families of directed strongly regular graphs using equitable partitions
نویسندگان
چکیده
منابع مشابه
New families of strongly regular graphs
In this article we construct a series of new infinite families of strongly regular graphs with the same parameters as the point-graphs of non-singular quadrics in PG(n, 2). We study these graphs, describing and counting their maximal cliques, and determining their automorphism groups.
متن کاملRepresentations of directed strongly regular graphs
We develop a theory of representations in Rm for directed strongly regular graphs, which gives a new proof of a nonexistence condition of Jørgensen [8]. We also describe some new constructions.
متن کاملConstruction of Directed Strongly Regular Graphs Using Finite Incidence Structures
We use finite incident structures to construct new infinite families of directed strongly regular graphs with parameters (l(q−1)q, l(q−1)q, (lq−l+1)q, (l−1)(q−1)q, (lq−l+1)q) for integers q and l (q, l ≥ 2), and (lq(q − 1), lq(q − 1), lq − l + 1, (l − 1)(q − 1), lq − l + 1) for all prime powers q and l ∈ {1, 2, . . . , q}. The new graphs given by these constructions include those with parameter...
متن کاملSmall vertex-transitive directed strongly regular graphs
We consider directed strongly regular graphs de2ned in 1988 by Duval. All such graphs with n vertices, n6 20, having a vertex-transitive automorphism group, are determined with the aid of a computer. As a consequence, we prove the existence of directed strongly regular graphs for three feasible parameter sets listed by Duval. For one parameter set a computer-free proof of the nonexistence is pr...
متن کاملDirected Strongly Regular Graphs and Their Codes
Directed Strongly Regular Graphs (DSRG) were introduced by Duval as a generalization of strongly regular graphs (SRG’s) [4]. As observed in [8] a special case of these are the doubly regular tournaments or equivalently, the skew Hadamard matrices. As the latter already lead to many interesting codes [10] it is natural to consider the more general case of codes constructed from the adjacency mat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2016
ISSN: 0012-365X
DOI: 10.1016/j.disc.2016.06.005